Why Eisenstein Proved the Eisenstein Criterion and Why Schönemann Discovered It First
نویسنده
چکیده
The Eisenstein irreducibility critierion is part of the training of every mathematician. I first learned the criterion as an undergraduate and, like many before me, was struck by its power and simplicity. This article will describe the unexpectedly rich history of the discovery of the Eisenstein criterion and in particular the role played by Theodor Schönemann. For a statement of the criterion, we turn to Dorwart’s 1935 article “Irreducibility of polynomials” in the American Mathematical Monthly [9]. As you might expect, he begins with Eisenstein:
منابع مشابه
T. N. Shorey’s Influence in the Theory of Irreducible Polynomials
The idea of looking at the prime factorization of the coefficients of a polynomial in Z[x] in order to establish its irreducibility (over Q) goes back to the classical Schönemann-Eisenstein criterion first derived in [29] and [6] in the middle of the 19th century. At the beginning of the 20th century, G. Dumas [5], again making use of primes that divide the coefficients of a polynomial, introdu...
متن کاملRoots of Generalized Schönemann Polynomials in Henselian Extension Fields
We study generalized Schönemann polynomials over a valued field F . If such a polynomial f is tame (i.e., a root of f generates a tamely ramified extension of F ), we give a best-possible criterion for when the existence in a Henselian extension field K of an approximate root of f guarantees the existence of an exact root of f in the extension field K. Let (F, v) be a valued field with residue ...
متن کاملThe boundary of the Eisenstein symbol by
In the case of an elliptic curve over a number field, this gives a criterion for the ‘integrality’ of Eisenstein symbol elements, and thus generalises a formula found by Bloch and Grayson [1986]. In the case of the universal elliptic curve, we obtain the boundary of the Eisenstein symbol at the cusps. (In characteristic zero an equivalent result was proved in [Beilinson 1986] by an analytic met...
متن کاملTotally Ramified Primes and Eisenstein Polynomials
is Eisenstein at a prime p when each coefficient ci is divisible by p and the constant term c0 is not divisible by p 2. Such polynomials are irreducible in Q[T ], and this Eisenstein criterion for irreducibility is the way nearly everyone first meets Eisenstein polynomials. Here, we will show Eisenstein polynomials are closely related to total ramification of primes in number fields. Let K be a...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The American Mathematical Monthly
دوره 118 شماره
صفحات -
تاریخ انتشار 2011